Multi-queue Limited Buffer Scheduling Problems in Flexible Flow Shop with Setup Times

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequencing Heuristics for Flexible Flow Shop Scheduling Problems with Unrelated Parallel Machines and Setup Times

This paper presents an investigation of scheduling procedures to seek the minimum of a positively weighted convex sum of makespan and the number of tardy jobs in a static flexible flow shop scheduling environment. The flexible flow shop problem is a scheduling of jobs in a flow shop environment consisting of series of production stages, some of which may have only one machine, but at least one ...

متن کامل

Solving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

متن کامل

Solving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

متن کامل

A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm

This paper  presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...

متن کامل

New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mechanical Engineering

سال: 2019

ISSN: 0577-6686

DOI: 10.3901/jme.2019.24.236